Entropy based probabilistic collaborative clustering
نویسندگان
چکیده
منابع مشابه
Entropy-based Consensus for Distributed Data Clustering
The increasingly larger scale of available data and the more restrictive concerns on their privacy are some of the challenging aspects of data mining today. In this paper, Entropy-based Consensus on Cluster Centers (EC3) is introduced for clustering in distributed systems with a consideration for confidentiality of data; i.e. it is the negotiations among local cluster centers that are used in t...
متن کاملAn Improved PSO Clustering Algorithm with Entropy-based Fuzzy Clustering
Particle swarm optimization is a based-population heuristic global optimization technology and is referred to as a swarm-intelligence technique. In general, each particle is initialized randomly which increases the iteration time and makes the result unstable. In this paper an improved clustering algorithm combined with entropy-based fuzzy clustering (EFC) is presented. Firstly EFC algorithm ge...
متن کاملEntropy-based fuzzy clustering and fuzzy modeling
Fuzzy clustering is capable of finding vague boundaries that crisp clustering fails to obtain. But time complexity of fuzzy clustering is usually high, and the need to specify complicated parameters hinders its use. In this paper, an entropy-based fuzzy clustering method is proposed. It automatically identifies the number and initial locations of cluster centers. It calculates the entropy at ea...
متن کاملHolo-Entropy Based Categorical Data Hierarchical Clustering
Clustering high-dimensional data is a challenging task in data mining, and clustering high-dimensional categorical data is even more challenging because it is more difficult to measure the similarity between categorical objects. Most algorithms assume feature independence when computing similarity between data objects, or make use of computationally demanding techniques such as PCA for numerica...
متن کاملEntropy-based metrics in swarm clustering
Ant-based clustering clustering methods have received significant attention as robust methods for clustering. Most ant-based algorithms use local density as a metric for determining the ants’ propensities to pick up or deposit a data item; however a number of authors in classical clustering methods have pointed out the advantages of entropy-based metrics for clustering. We introduce an entropy ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 2017
ISSN: 0031-3203
DOI: 10.1016/j.patcog.2017.07.014